Information collecting situations and bi-monotonic allocation schemes

Information collecting situations and bi-monotonic allocation schemes

Link Monotonic Allocation Schemes

A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allocation scheme is link monotonic if extending the network does not decrease the payoff of any play...

Compensations in information collecting situations

How to compensate people who provide relevant information to a decision-maker who faces uncertainty? This paper suggests some compensation rules. These are studied both in a cooperative and a noncooperative environment. JEL codes: C71, C72, D89.

Monotonic allocation schemes in clan games

Total clan games are characterized using monotonicity, veto power of the clan members, and a concavity condition re°ecting the decreasing marginal contribution of non-clan members to growing coalitions. This decreasing marginal contribution is incorporated in the notion of a bi-monotonic allocation scheme, where the value of each coalition is divided over its members in such a way that the clan...

Fuzzy clan games and bi-monotonic allocation rules

In this paper the class of fuzzy clan games is introduced. The cores of such games have an interesting shape which inspires to define a class of compensation-sharing rules that are additive and stable on the cone of fuzzy clan games. Further, the notion of bi-monotonic participation allocation scheme (bi-pamas) is introduced and it turns out that each core element of a fuzzy clan game is extend...